Construct a Bipartite Signed Network in YouTube

نویسندگان

  • Tianyuan Yu
  • Liang Bai
  • Jinlin Guo
  • Zheng Yang
چکیده

Nowadays, the video-sharing websites are becoming more and more popular, which leads to latent social networks among videos and users. In this work, results are integrated with the data collected from YouTube, one of the largest user-driven online video repositories, and are supported by Chinese sentiment analysis which excels the state of art. Along with it, the authors construct two types of bipartite signed networks, video network (VN) and topic participant network (TPN), where nodes denote videos or users while weights of edges represent the correlation between the nodes. Several indices are defined to quantitatively evaluate the importance of the nodes in the networks. Experiments are conducted by using YouTube videos and corresponding metadata related to two specific events. Experimental results show that both the analysis of social networks and indices correspond very closely with the events’ evolution and the roles that topic participants play in spreading Internet videos. Finally, the authors extend the networks to summarization of a video set related to an event. Construct a Bipartite Signed Network in YouTube

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SibRank: Signed Bipartite Network Analysis for Neighbor-based Collaborative Ranking

Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking meth...

متن کامل

Signed degree sets in signed bipartite graphs

A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...

متن کامل

A Note on Signed Degree Sets in Signed Bipartite Graphs

A signed bipartite graph G(U, V ) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V ) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V ) is called its signed degree set. In this paper, we prove that every set ...

متن کامل

On the Spectral Evolution of Large Networks

In this thesis, I study the spectral characteristics of large dynamic networks and formulate the spectral evolution model. The spectral evolution model applies to networks that evolve over time, and describes their spectral decompositions such as the eigenvalue and singular value decomposition. The spectral evolution model states that over time, the eigenvalues of a network change while its eig...

متن کامل

Designing an Ontology for Knowledge Discovery in Iran’s Vaccine

Ontology is a requirement engineering product and the key to knowledge discovery. It includes the terminology to describe a set of facts, assumptions, and relations with which the detailed meanings of vocabularies among communities can be determined. This is a qualitative content analysis research. This study has made use of ontology for the first time to discover the knowledge of vaccine in Ir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJMDEM

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2015